#include <iostream>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <functional>
#include <set>
using namespace std;


class Solution {
public:
    int translateNum(int num) {
        string nums = to_string(num);
        int n = nums.size();
        vector<int> dp(n+1,0);
        dp[1] = 1;
        for(int i = 2;i<n+1;i++){
            dp[i] = dp[i-1]+(nums.substr(i-1,2)<="25"?dp[i-1]:0);
        }
        return dp[n];

    }
};

int main(){
    Solution a;
    cout<<a.translateNum(12258);
}